Meta%2Dlearning for Post%2Dprocessing of Association Rules.

Mining and Post%2Dprocessing of Association Rules in the Atherosclerosis Risk Domain.

An XML Format for Association Rule Models Based on the GUHA Method.

Logical Aspects of the Measures of Interestingness of Association Rules.

The GUHA method and its meaning for data mining.

Foundations of Intelligent Systems
The aim of this paper is to introduce the theoretical foundations of an approach for intelligent systems development. Derived from semiotics, a classic discipline in human sciences, the theory developed provides a mathematical framework for the concept of knowledge and for knowledge processing. As a result, a new perspective to study and to develop intelligent systems emerges. A taxonomy of elementary types of knowledge is proposed based on the classification of types of signs in semiotics, followed by a another classification of knowledge from the point of view of application in cognitive systems. In addition, we propose the mathematical definition of objects, objects systems and objects networks, to model mathematically the different types of knowledge described. The symbiosis of such key concepts introduces a computational paradigm to develop and implement intelligent systems, called here computational semiotics. 
Action Rules and the GUHA Method Preliminary Considerations and Results.



LAREDAM %2D Considerations on System of Local Analytical Reports from Data Mining.

Classes of Association Rules An Overview.

Observational Calculi%2C Classes of Association Rules and F%2Dproperty.

Project SEWEBAR Considerations on Semantic Web and Data Mining.

Semantic Web Presentation of Analytical Reports from Data Mining %2D Preliminary Considerations.

Lessons Learned from the ECML%2FPKDD Discovery Challenge on the Atherosclerosis Risk Factors Data.

Many Sorted Observational Calculi for Multi%2DRelational Data Mining.

On the Logic of Medical Decision Support.

Mining for Patterns Based on Contingency Tables by KL%2DMiner %2D First Experience.

Definability of Association Rules in Predicate Calculus.

Definability of Association Rules in Predicate Calculus.

Ontology%2DEnhanced Association Mining.
Abstract. The roles of ontologies in KDD are potentially manifold. We track them through different phases of the KDD process, from data understanding through task setting to mining result interpretation and sharing over the semantic web. The underlying KDD paradigm is association mining tailored to our 4ft-Miner tool. Experience from two different application domains—medicine and sociology—is presented throughout the paper. 1
Ontology%2DEnhanced Association Mining.
Abstract. The roles of ontologies in KDD are potentially manifold. We track them through different phases of the KDD process, from data understanding through task setting to mining result interpretation and sharing over the semantic web. The underlying KDD paradigm is association mining tailored to our 4ft-Miner tool. Experience from two different application domains—medicine and sociology—is presented throughout the paper. 1

GUHA method and granular computing.


Reporting Data Mining Results in a Natural Language.

Logic of Association Rules.

The GUHA Method%2C Data Preprocessing and Mining.

SDS%2Drules and association rules.

Converting Association Rules into Natural Language %2D an Attempt.

The GUHA Method and Foundations of %28Relational%29 Data Mining.

Mining and Querying in Association Rule Discovery.

Content%2Dbased Retrieval of Analytical Reports.
Analytic reports are special textual documents containing  condensed results from a data mining process. Embedded knowledge enables  the interpretation of the reports by automated procedures, which  opens the way to content-based retrieval. We elaborate the technique  for statistical association rules as specific form of discovered knowledge,  demonstrate its formal apparatus on examples from the medical domain,  and outline the perspectives of sharing and reusing the content of analytic  reports over the Semantic Web.
Mining for Association Rules by 4ft%2DMiner.
Introduction  Procedure 4ft-Miner mines for association rules &#039;   where &#039; and  are derived Boolean attributes. Symbol  is 4ft quanti  er. Intuitive meaning of &#039;   is that &#039; and  are in relation given by the symbol . Association rule &#039;   is veri  ed using four-fold contingency table of &#039; and . There are association rules corresponding to statistical hypotheses tests see section 2. 4ft-Miner mines also for conditional association rules of the form &#039;  =, see section 3.  An example of 4ft-Miner application is in section 4. Main features of 4ftMiner are summarised in section 5. Procedure 4ft-Miner does not use A-priori algorithm. Implementation of 4ft-Miner is based on suitable strings of bits see section 6. Various theoretical results are related to 4ft-Miner see section 7.  Let us remark that 4ft-Miner is a GUHA procedure in the sense of [2].  2 Association Rules  Association rule is an expression &#039;   where &#039; and  are derived Boolean attributes. Boolean attributes &#039; and  correspon
Mining for 4ft Association Rules.

Principles of Data Mining and Knowledge Discovery
 We consider the problem of finding statistically unusual subgroups  in a multi-relation database, and extend previous work on singlerelation  subgroup discovery. We give a precise definition of the multirelation  subgroup discovery task, propose a specific form of declarative  bias based on foreign links as a means of specifying the hypothesis space,  and show how propositional evaluation functions can be adapted to the  multi-relation setting. We then describe an algorithm for this problem  setting that uses optimistic estimate and minimal support pruning, an  optimal refinement operator and sampling to ensure efficiency and can  easily be parallelized.  
Deduction in Logic of Association Rules.

Four%2DFold Table Calculi for Discovery Science.

Logics and Statistics for Association Rules and Beyond Abstract of Tutorial.

Four%2DFold Table Calculi for Discovery Science.

Classes of Four%2DFold Table Quantifiers.

Logical Calculi for Knowledge Discovery in Databases.

Main Problems and Further Possibilities of the Computer Realization of GUHA Procedures.

